The sandpile group of a tree

نویسنده

  • Lionel Levine
چکیده

Proof. If the edge (r, s) from the root to the sink is included in the spanning tree, then each of the principal branches of Tn may be assigned an oriented spanning tree independently, so there are t n−1 such spanning trees. On the other hand, if (r, s) is not included in the spanning tree, there is a directed path r → x1 → . . . → xn−1 → s in the spanning tree from the root to the sink. In this case, every principal branch except the one rooted at x1 may be assigned an oriented spanning tree independently; within the branch rooted at x1, every subbranch except the one rooted at x2 may be assigned an oriented spanning tree independently; and so on (see Figure 1). Since there are (d − 1) possible paths x1 → . . . → xn−1, we conclude that

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The sandpile group of a bilateral regular tree

Let Tn be a (d − 1)-ary tree of height n. A bilateral regular tree is the multigraph T d n,n that is defined by : (i) juxtaposing two Tn’s, (ii) drawing a new edge between two roots and (iii) drawing d− 1 edges between each leaf and a new vertex, called the sink. In this paper the sandpile group of T d n,n is determined.

متن کامل

Sandpile groups and spanning trees of directed line graphs

We generalize a theorem of Knuth relating the oriented spanning trees of a directed graph G and its directed line graph LG. The sandpile group is an abelian group associated to a directed graph, whose order is the number of oriented spanning trees rooted at a fixed vertex. In the case when G is regular of degree k, we show that the sandpile group of G is isomorphic to the quotient of the sandpi...

متن کامل

On the sandpile group of regular trees

The sandpile group of a connected graph is the group of recurrent configurations in the abelian sandpile model on this graph. We study the structure of this group for the case of regular trees. A description of this group is the following: Let T (d, h) be the d-regular tree of depth h and let V be the set of its vertices. Denote the adjacency matrix of T (d, h) by A and consider the modified La...

متن کامل

Chip-Firing and Rotor-Routing on Z and on Trees

The sandpile group of a graph G is an abelian group whose order is the number of spanning trees of G. We find the decomposition of the sandpile group into cyclic subgroups when G is a regular tree with the leaves are collapsed to a single vertex. This result can be used to understand the behavior of the rotor-router model, a deterministic analogue of random walk studied first by physicists and ...

متن کامل

Infinite volume limits of high-dimensional sandpile models

We study the Abelian sandpile model on Z. In d ≥ 3 we prove existence of the infinite volume addition operator, almost surely with respect to the infinite volume limit μ of the uniform measures on recurrent configurations. We prove the existence of a Markov process with stationary measure μ, and study ergodic properties of this process. The main techniques we use are a connection between the st...

متن کامل

2 4 M ay 2 00 7 Infinite volume limit of the Abelian sandpile model in dimensions d ≥ 3 Antal

We study the Abelian sandpile model on Z. In d ≥ 3 we prove existence of the infinite volume addition operator, almost surely with respect to the infinite volume limit μ of the uniform measures on recurrent configurations. We prove the existence of a Markov process with stationary measure μ, and study ergodic properties of this process. The main techniques we use are a connection between the st...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Eur. J. Comb.

دوره 30  شماره 

صفحات  -

تاریخ انتشار 2009